Procedure for the recognition of active code sequences

ABSTRACT

A procedure for determining active code sequences of a plurality of overlaid code sequences (c α (ν)·g α ), wherein the active code sequences have a greater gain factor(g α ) than the inactive code sequences, includes: (1) formation of a cost function(L) dependent upon unknown estimated values({tilde over (g)} α , ĝ α ) of the gain factors (g α ) of composite code sequences(c α (ν)·g α ), (2) partial differentiation of the cost function (L) in accord with the unknown estimated values({tilde over (g)} α ĝ α ) of the gain factors(g α ), (3) formation of an equation system from the presupposition that all partial differentials of the cost function (L) are zero and a minimum of the cost function (L) is present, (4) determination of the estimated values ({tilde over (g)}, ĝ α ) of the gain factors (g α ) by solving the equation system, and (5) determining that an active code sequence exists, if the estimated values({tilde over (g)} α , ĝ α ) of the corresponding gain factors (g α ) are greater than a specified threshold value.

BACKGROUND OF THE INVENTION

[0001] The invention concerns a procedure for the determination of active code sequences, in particular, of identification sequences (midamples) in mobile radio systems, especially for the TDD-Mode of the Standards 3GPP.

[0002] The employment of Time Division Duplex (TDD) for the uplink (connection of the mobile station to the base station) and the downlink (connection of the base station to the mobile station) for various mobile radio standards has been made known, for example, by T. Ojanpera, R. Prasad “Wideband CDMA for Third Generation Mobile Communications”, Artech House, 1998, ISBN 0-89006-735-X, Pages 261 to 277. Therein, a TDD Modus is presented, in which each downlink and uplink slot of the TDD framework is split up into a plurality of code channels with an orthogonal spreading code. Each code channel comprises a first data zone, a second data zone and an identification sequence (midample) placed between the said data zones. Although the data chip sequences, because of multiplication with orthogonal spreading codes, are orthogonal to one another, the identification sequences (midamples) are not orthogonal to each other.

[0003] In certain operational situations checks must be made, to see which identification sequences (midamples) are active. Fundamentally, this could be done by correlation of the received data sequence in the midample area, inclusive of all allowable midamples (identification sequences). By the squaring of the correlation-coefficients, a capacity centered evaluation can be achieved. If the square of a defined correlation coefficient, in relation to the entire capacity of the sum of the midamples oversteps in a logarithmic scale a certain threshold, then the conclusion could rest on an active midample, and hence on an active code channel. This procedure adapts itself, however, only to the detection of the active midamples, providing that the midample-code-sequences exhibit a satisfactory cross-correlation characteristic. In the case of short midample-code-sequences and a high degree of disturbance, then, because of the poor cross correlation characteristics, erroneous or failed detection comes to the fore, because no clear-cut threshold can be found, which separates a valid hypothesis from a faulty hypothesis.

[0004] All references cited herein are incorporated herein by reference in their entireties.

BRIEF SUMMARY OF THE INVENTION

[0005] Thus the invention has the purpose of creating a procedure for the recognition of code sequences along with a corresponding computer program, which operates with a high degree of reliability, even in the case of small signal/noise relationships and poor cross correlation characteristics of the to-be-recognized code signals.

[0006] The basis of the invention is the recognition, that by means of the establishment of a cost-function and the partial differentiation after the gain factors of the individual code sequences a particularly secure procedure for the detection of the active code sequences can be created.

[0007] It is particularly of advantage to compute and to store, on a one-time basis, the matrix of the equation systems, which arises from the partial differentiation of the cost-function. Meanwhile, the actual detection procedure, in that case, can then be referred back onto these previously computed and saved coefficients, so that the invented procedure, with a relatively small investment in implementation, can be accomplished with a relatively small time spent in computation.

BRIEF DESCRIPTION OF SEVERAL VIEWS OF THE DRAWINGS

[0008] In the following, an embodiment of the invention will be more closely described with the aid of the drawings, wherein:

[0009]FIG. 1 is a TDD framework of the ESTI wideband-CDMA TDD mode, in which the invented procedure can be applied,

[0010]FIG. 2 is a model of the sender based on the invented, procedure, and

[0011]FIG. 3 is a model of the transmission channel, said model being based on the invented procedure.

DETAILED DESCRIPTION OF THE INVENTION

[0012]FIG. 1 shows a TDD-framework of the ETSI (European Telecommunications Standards Institute) wideband—CDMA (Code Division Multiple Access) TDD (Time Division Duplex) mode, whereby, with the aid of FIG. 1, an application example of the invented procedure can be explained. The application of the invented procedure is, however, not only for the TDD-mode by a mobile radio system, but entirely generally applicable for the recognition of code signals with little signal/noise ratio.

[0013] In the case of the TDD-Mode, different time slots of the TDD-frame are used for the down-link (connection between base station BS and the mobile station MS) and the up-link (connection between the mobile station MS and the base station BS) in a time-multiplex process. In the exemplary schematic presented in FIG. 1, some slots are continually in the down-link, other slots are placed continually in up-link service, while a plurality of slots are variable and can be assigned to the up-link (MS TX) and down-link (BS TX). Each slot arrays itself in different code channels K_(O) to K_(N1-1). Each code channel comprises a first data area Dat.1 and a second data area Dat.2 and an identification sequence placed between the said data areas, which, hereafter will be referred to as “midample”. Each code channel K_(a) can be assigned to a different midample C_(a) (1)·g_(a), whereby Ca(1) denotes the code sequence of the midample and g_(a) stands for the gain factor. Then, according to whether the corresponding code channel K_(a) is active, then also its dedicated midample is active, that is, for active code channels where g_(a)>0 is valid. Conversely, for non-active code channels the valid expression is g_(a)=0.

[0014] Since, in the data areas Dat.1 and Dat.2, the data symbols with orthogonal spreading codes are multiplied and the chip sequences, on this account, are also orthogonal, the code sequences of the midamples of the various code canals, namely, K_(O) to K_(N1-1) are not orthogonal.

[0015] In certain operational situations, the determination must be made, as to which midamples are active and which midamples are not active. To this purpose, the present invention can be utilized, which will be described and explained below.

[0016] In the description hereafter, the following formula symbols will be used:

[0017] v time index on the chip surface

[0018] c_(a(v)) normalized capacity, descrambled, non-deformed chip signal of the a-ten_(midample) code

[0019] g₆₀ gain factor of the a-ten midample code

[0020] {tilde over (g)}₆₀ {tilde over (g)}₆₀ , ĝ_(α)and the estimated gain factor of the a-ten midample code

[0021] j square root of −1

[0022] M relative capacity threshold

[0023] n(v) additive disturbance

[0024] N length of the midample code

[0025] N₁ number of the midample codes

[0026] r(v) measurement signal

[0027] REAL {. . . } real (built-in) function

[0028] s(v) reference signal

[0029] In FIG. 2 is schematically shown a block circuit diagram of a representation, in keeping with the invented procedure, of the sender 1. The undistorted midample codes c_(a) (v) are multiplied by the gain factors g_(a), and summarized in an adding device 3 and transmitted in parallel. The codes of the midamples c_(a) (v) are, in general not orthogonal.

[0030] The representation of the transmission channel 4, which is in agreement with the invented procedure, as it is presented schematically in FIG. 3, takes into consideration an additive disturbance n(v), which, in adding device 5 overlays the referring signal and biases the measurement signal r(v).

[0031] The invented procedure for the detection of the midamples uses a common maximum favorable probability estimation, which employs the following cost function: $\begin{matrix} {{{L\left( {\overset{\sim}{g}}_{a} \right)} = {\sum\limits_{v = 0}^{N - 1}{{{r(v)} - {\sum\limits_{a}{{\overset{\sim}{g}}_{a} \cdot {c_{a}(v)}}}}}^{2}}},} & (1) \end{matrix}$

[0032] in order to estimate the gain factors of the midamples. In this equation, r(v) is the measurement signal, c_(a)(v) is the complex, capacity normed, undistorted signal of the a-ten midample and g_(a) is the gain factor of the a-ten midample. Also, {tilde over (g)}_(α)denotes the trial value of the gain factor g_(a).

[0033] For the calculation of the partial differentiation of the cost function in accord with the unknown parameters, the following formality is employed: an unknown parameter x is a real number, the constants c and d are complex numbers and a general cost function

L=|c·x+d| ²=(c·x+d)·(c·x+d)*=|c| ²·x² +c *·d·x+c·d*·x+|d| ²   (2)

[0034] employs the square of the amount. Then, the partial derivative can be computed in this manner: $\begin{matrix} {\frac{\partial L}{\partial x} = {{2 \cdot {c}^{2} \cdot x} + {{2 \cdot {REAL}}{\left\{ {c \cdot d^{*}} \right\}.}}}} & (3) \end{matrix}$

[0035] Having equation (3), a partial differentiation will yield, in accord with the estimated value ĝ_(a) of the gain factors of the midamples: $\begin{matrix} {\frac{\partial L}{\partial{\hat{g}}_{a}} = {{{2{\sum\limits_{v = 0}^{N - 1}{{{c_{a}(v)}}^{2} \cdot {\hat{g}}_{a}}}} + {2{\sum\limits_{v = 0}^{N - 1}{{REAL}\left\{ {{- {c_{a}(v)}} \cdot {a_{3}^{*}(v)}} \right\}}}}} = 0}} & (4) \end{matrix}$

$\begin{matrix} {{a_{3}(v)} = {{r(v)} - {\sum\limits_{\mu \neq a}{{\overset{\sim}{g}}_{\mu} \cdot {{c_{\mu}(v)}.}}}}} & (5) \end{matrix}$

[0036] The equations (4, 5) can be condensed into a matrix-vector mode, giving:

└A _(α,μ) ┘·└ĝ _(μ) ┘=[b _(α)]  (6)

[0037] whereby the coefficients of the lines reduce themselves to: $\begin{matrix} {b_{a} = {\sum\limits_{v}{{REAL}\left\{ {{c_{a}(v)} \cdot {r^{*}(v)}} \right\}}}} & (7) \\ {A_{a,\mu} = {\sum\limits_{v}{{REAL}\left\{ {{c_{a}(v)} \cdot {c_{\mu}^{*}(v)}} \right\}}}} & (8) \end{matrix}$

[0038] If the linear equation is solved, then the sought for optimal estimated value ĝ_(a) of the gain factors g_(a) becomes known.

[0039] Using then, as a starting point, the estimated value ĝ_(a) of the midamples, the entire capacity of the midamples can be approximated by $\begin{matrix} {{\hat{P}}_{Midamble} = {\sum\limits_{a}\left( {\hat{g}}_{a} \right)^{2}}} & (9) \end{matrix}$

[0040] If the capacity of a midample code oversteps $\begin{matrix} {{10\quad \log_{10}\frac{{\hat{g}}_{a}^{2}}{{\hat{P}}_{Midamble}}} > M} & (10) \end{matrix}$

[0041] the above relative, logarithmic capacity threshold M, then the midample code is classified as an active midample code.

[0042] The probability of detection of error in the procedure presented here is clearly much less, in comparison to a simple correlation procedure.

[0043] The greatest expenditure of time and effort in the procedure lies in the computation of the correlation coefficients b_(a) between the undeformed midample codes and the measurement signal according to the equation (8). For the solving of the equation system, the coefficients of the inverse matrix A⁻¹ can be computed ahead of time and stored in memory. For this operation, one requires, for the solving of the equation system one needs only the second power of the number N₁ of the midample codes operations. The numerical complexity of the presented procedure is also, in comparison to the simple correlation procedure, only a slight bit greater, in case the number N₁ of the midample codes in comparison to the length N of the midample codes is too small.

[0044] While the invention has been described in detail and with reference to specific examples thereof, it will be apparent to one skilled in the art that various changes and modifications can be made therein without departing from the spirit and scope thereof. 

What is claimed is:
 1. A process for determining active code sequences of a plurality of superimposed code sequences (c_(α)(ν)·g_(α)), wherein the active code sequences exhibit greater gain factors (g_(α)) than do inactive code sequences, the process comprising: formation of a cost function (L) dependent upon unknown but estimated values ({tilde over (g)}_(α, ĝ) _(α)) of the gain factors (g_(α)) of the combined code sequences (c_(α)(ν)·g_(α)), partial differentiation of the cost function (L) in accord with the unknown estimated values ({tilde over (g)}_(α), ĝ_(α)) of the gain factors (g_(α)) formation of a correlation system from an assumption that all partial differentiations of the cost function (L) are zero and thus a minimum of the cost function (L) exists, determination of the estimated values({tilde over (g)}_(α), {tilde over (g)}_(α)) of the gain factors (g_(α)) by solving equation systems, and determining that an active code sequence exists, when the estimated values ({tilde over (g)}_(α), ĝ_(α)) of the corresponding gain factors(g_(α)) are greater than a specified threshold.
 2. The process of claim 1, wherein the cost function (L) is linearized by series development before the partial differentiation.
 3. The process of claim 2, wherein the cost function L is ${{L\left( {\overset{\sim}{g}}_{a} \right)} = {\sum\limits_{v = 0}^{N - 1}{{{r(v)} - {\sum\limits_{a}{{\overset{\sim}{g}}_{a} \cdot {c_{a}(v)}}}}}^{2}}},$

where r(ν) is a composite signal subjected to a disturbing signal of a code sequence c_(α)(ν)·g_(α), g_(α)is a gain factor of a-ten code sequences c_(α)(ν)·g_(α), c_(α)(ν) is a normalized code sequence on the gain factor g_(α)=1, and {tilde over (g)}_(α)is the unknown estimated value of the gain factor g_(α)of the a-ten code sequences c_(α)(ν)·g_(α).
 4. The process of claim 3, wherein by means of partial differentiation of the linearized cost function L in accord with the unknown estimated values {tilde over (g)}_(α)the gain factor g_(α)the equation system to be solved └A _(α,μ)┘·[ĝ _(α)]=[b _(α)] is obtained, wherein the coefficients of the equation system are: $\begin{matrix} {b_{a} = {\sum\limits_{v}{{REAL}\left\{ {{c_{a}(v)} \cdot {r^{*}(v)}} \right\}}}} \\ {A_{a,\mu} = {\sum\limits_{v}{{REAL}{\left\{ {{c_{a}(v)} \cdot {c_{\mu}^{*}(v)}} \right\}.}}}} \end{matrix}$


5. The process of claim 4, wherein the coefficients $A_{a,\mu} = {\sum\limits_{v}{{REAL}\left\{ {{c_{a}(v)} \cdot {c_{\mu}^{*}(v)}} \right\}}}$

are only computed once and at each carrying out of the computation can be employed again.
 6. The process of claim 1, wherein the estimated values of ĝ_(a) of the gain factors g_(α)obtained by the solution of the equation system are squared and the sum squares ${\hat{P}}_{Midamble} = {\sum\limits_{a}\left( {\hat{g}}_{a} \right)^{2}}$

is formed, whereby an active code sequence is determined, provided that ${10\quad \log_{10}\frac{{\hat{g}}_{a}^{2}}{{\hat{P}}_{Midamble}}} > M$

is valid, wherein M is a given threshold value.
 7. The process of claim 1, wherein the code sequences(c_(α)(ν)·g_(α)) are identification sequences (midamples) of a code channel of a CDMA-mobile radio system.
 8. A computer program with a program code for executing the process of claim 1 when the program is run in a computer.
 9. A computer program with a programmed code stored on a machine-readable carrier, wherein the program executes the process of claim 1 when the program is run in a computer. 